Grid based variational approximations
نویسنده
چکیده
Variational methods for approximate Bayesian inference provide fast, flexible, deterministic alternatives to Monte Carlo methods. Unfortunately, unlike Monte Carlo methods, variational approximations cannot, in general, be made to be arbitrarily accurate. This paper develops grid-based variational approximations which endeavor to approximate marginal posterior densities in a spirit similar to the Integrated Nested Laplace Approximation (INLA) of Rue, Martino & Chopin (2009) but may be applied in situations where INLA cannot be used. The method can greatly increase the accuracy of a base variational approximation, although not in general to arbitrary accuracy. The methodology developed is at least reasonably accurate on all of the examples considered in the paper.
منابع مشابه
B–Spline Based Monotone Multigrid Methods, with an Application to the Prizing of American Options
We propose a monotone multigrid method based on a B–spline basis of arbitrary smoothness for the efficient numerical solution of elliptic variational inequalities on closed convex sets. In order to maintain monotonicity (upper bound) and quasi–optimality (lower bound) of the coarse grid corrections, we propose coarse grid approximations of the obstacle function which are based on B–spline expan...
متن کاملB-Spline Based Monotone Multigrid Methods, with an Application to the Pricing of American Options
We propose a monotone multigrid method based on a B–spline basis of arbitrary smoothness for the efficient numerical solution of elliptic variational inequalities on closed convex sets. In order to maintain monotonicity (upper bound) and quasi–optimality (lower bound) of the coarse grid corrections, we propose coarse grid approximations of the obstacle function which are based on B–spline expan...
متن کاملB-Spline-Based Monotone Multigrid Methods
Abstract. For the efficient numerical solution of elliptic variational inequalities on closed convex sets, multigrid methods based on piecewise linear finite elements have been investigated over the past decades. Essential for their success is the appropriate approximation of the constraint set on coarser grids which is based on function values for piecewise linear finite elements. On the other...
متن کاملVariational Formulation of Macro-Particle Algorithms for Kinetic Plasma Simulations
A variational method is used to derive a self-consistent macro-particle model for relativistic electromagnetic kinetic plasma simulations. Extending earlier work [1], the discretization of the electromagnetic Low Lagrangian is performed via a reduction of the phase-space distribution function onto a collection of finite-sized macro-particles of arbitrary shape and discretization of field quanti...
متن کاملA Splitting Algorithm for Image Segmentation on Manifolds Represented by the Grid Based Particle Method
We propose a numerical approach to solve variational problems on manifolds represented by the Grid Based Particle Method (GBPM) recently developed in [1–4]. In particular, we propose a splitting algorithm for image segmentation on manifolds represented by unconnected sampling particles. To develop a fast minimization algorithm, we propose a new splitting method by generalizing the augmented Lag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computational Statistics & Data Analysis
دوره 55 شماره
صفحات -
تاریخ انتشار 2011